Content-Identification: towards Capacity Based on Bounded Distance Decoder
نویسندگان
چکیده
In recent years, content identification based on digital fingerprinting attracts a lot of attention in different emerging applications. In this paper, we perform the information–theoretic analysis of finite length digital fingerprinting systems. We show that the identification capacity over the Binary Symmetric Channel (BSC) is achievable by using Bounded Distance Decoder (BDD).
منابع مشابه
Chase-Like Bounded-Distance Decoding with O(d2/3) Trials
A soft-decision decoder for an error-correcting block code of Hamming distance d is said to achieve bounded-distance (BD) decoding if its error-correction radius is equal to that of a complete Euclidean distance decoder. The Chase decoding algorithms are reliability-based algorithms achieving BD decoding. The least complex version of the original Chase algorithms (“Chase-3”) uses O(d) trials of...
متن کاملOn the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes
Rank metric codes can either be used as such for error correction in data storage equipments, or be lifted into constant-dimension codes (CDCs) and thus be used for error correction in random network coding. This paper investigates the decoder error probability (DEP) of rank metric codes and CDCs. We first study the DEP of rank metric codes using a bounded rank distance decoder. We derive asymp...
متن کاملJa n 20 06 Improved Nearly - MDS Expander Codes ∗
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a linear-time bounded-distance decoder. By using a version of the decoder that corrects also erasures, the codes can replace MDS outer codes in concatenated construc...
متن کاملPerformance of the Bounded Distance Decoder on the AWGN Channel
In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total word error rate, Pw, and the undetected error rate, Pu. Excellent agreement is found with simulation results for a small code, and the bounds are shown to be ...
متن کاملLow-complexity Chase-like bounded-distance decoding algorithms
A soft-decision decoder for an error-correcting block code of Hamming distance d is said to achieve boundeddistance (BD) decoding if its error-correction radius is equal to that of a complete Euclidean distance decoder. The Chase decoding algorithms are reliability-based algorithms achieving BD decoding. The least complex version of the original Chase algorithms (“Chase-3”) uses about d/2 trial...
متن کامل